Coding theory

Results: 1371



#Item
11New towers over finite fields Henning Stichtenoth, Sabanci University, Istanbul, Turkey The aim of this talk is to present a recent result by A. Bassa, P. Beelen, A. Garcia and H. Stichtenoth, which includes and generali

New towers over finite fields Henning Stichtenoth, Sabanci University, Istanbul, Turkey The aim of this talk is to present a recent result by A. Bassa, P. Beelen, A. Garcia and H. Stichtenoth, which includes and generali

Add to Reading List

Source URL: www.math.uni-magdeburg.de

Language: English - Date: 2013-05-01 09:15:44
12INTERSECTED LOW-DENSITY PARITY-CHECK AND CONVOLUTIONAL CODES Edward A. Ratzer Cavendish Laboratory, University of Cambridge, Cambridge Key words to describe this work: Low-density parity-check (LDPC) codes, convolutional

INTERSECTED LOW-DENSITY PARITY-CHECK AND CONVOLUTIONAL CODES Edward A. Ratzer Cavendish Laboratory, University of Cambridge, Cambridge Key words to describe this work: Low-density parity-check (LDPC) codes, convolutional

Add to Reading List

Source URL: www.inference.phy.cam.ac.uk

Language: English - Date: 2003-03-06 10:25:56
13Knowledge / Academia / Science / Qualitative research / Grounded theory / Coding / Methodology / Ethnography / Research / Multimethodology / Participant observation / Ceres

DOC Document

Add to Reading List

Source URL: ceres.fss.uu.nl

Language: English - Date: 2015-12-14 09:44:47
14Repetition and dual coding in procedural multimedia presentations

Repetition and dual coding in procedural multimedia presentations

Add to Reading List

Source URL: spatialintelligence.org

Language: English - Date: 2010-05-12 14:42:03
15Low-density parity-check codes on Markov channels Edward A. Ratzer Cavendish Laboratory, Madingley Road, Cambridge CB3 0HE Phone: +Email:

Low-density parity-check codes on Markov channels Edward A. Ratzer Cavendish Laboratory, Madingley Road, Cambridge CB3 0HE Phone: +Email:

Add to Reading List

Source URL: www.inference.phy.cam.ac.uk

Language: English - Date: 2002-12-16 07:44:07
16ISIT 2003, Yokohama, Japan, June 29 – July 4, 2003  Sparse Data Blocks and Multi-User Channels Edward A. Ratzer Cavendish Laboratory, University of Cambridge Madingley Road, Cambridge CB3 0HE, UK

ISIT 2003, Yokohama, Japan, June 29 – July 4, 2003 Sparse Data Blocks and Multi-User Channels Edward A. Ratzer Cavendish Laboratory, University of Cambridge Madingley Road, Cambridge CB3 0HE, UK

Add to Reading List

Source URL: www.inference.phy.cam.ac.uk

Language: English - Date: 2003-06-05 10:39:01
17Upper and Lower Bounds for Finding Connected Motifs in Vertex-Colored Graphs ⋆ Michael R. Fellows a,1 Guillaume Fertin b Danny Hermelin c,2 and St´ephane Vialette d a Office

Upper and Lower Bounds for Finding Connected Motifs in Vertex-Colored Graphs ⋆ Michael R. Fellows a,1 Guillaume Fertin b Danny Hermelin c,2 and St´ephane Vialette d a Office

Add to Reading List

Source URL: pagesperso.lina.univ-nantes.fr

Language: English - Date: 2011-04-27 05:26:37
18IEEE COMSOC MMTC E-Letter Synthesis Filter/Decoder Structures in Speech Codecs Jerry D. Gibson, Electrical & Computer Engineering, UC Santa Barbara, CA, USA  Abstract Using the Shannon backward channel

IEEE COMSOC MMTC E-Letter Synthesis Filter/Decoder Structures in Speech Codecs Jerry D. Gibson, Electrical & Computer Engineering, UC Santa Barbara, CA, USA Abstract Using the Shannon backward channel

Add to Reading List

Source URL: vivonets.ece.ucsb.edu

Language: English - Date: 2012-04-02 19:01:54
19Sharp Tractability Borderlines for Finding Connected Motifs in Vertex-Colored Graphs Michael R. Fellows1 , Guillaume Fertin2 , Danny Hermelin?3 , and St´ephane Vialette4 1  School of Electrical Engineering and Computer

Sharp Tractability Borderlines for Finding Connected Motifs in Vertex-Colored Graphs Michael R. Fellows1 , Guillaume Fertin2 , Danny Hermelin?3 , and St´ephane Vialette4 1 School of Electrical Engineering and Computer

Add to Reading List

Source URL: pagesperso.lina.univ-nantes.fr

Language: English - Date: 2011-04-27 12:10:56
20Discovery of Huffman codes Inna Pivkina∗ 1  Introduction

Discovery of Huffman codes Inna Pivkina∗ 1 Introduction

Add to Reading List

Source URL: bioinfo.ict.ac.cn

Language: English - Date: 2014-11-28 11:05:21